Finite State Machine Testing from an or State Refinement Design
نویسندگان
چکیده
The paper formalizes the OR refinement of finite state machines and develops an efficient method to integrate the test sets of the component machines in order to test the flattened machine. The approach supports componentsoftware development since it constructs test sets for an assembly of systems from readily available test sets of the prefabricated parts.
منابع مشابه
Restricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملTest-Case Calculation through Abstraction
This paper discusses the calculation of test-cases for interactive systems. A novel approach is presented that treats the problem of test-case synthesis as an abstraction problem. The refinement calculus is used to formulate abstraction rules for calculating correct test-case scenarios from a formal contract. This abstraction calculus results in a synthesis method that, does not need to compute...
متن کاملTest Generation for a System of Communicating Finite State Machines
A system of communicating finite state machines (SCFSM) is a usual design model of a complicated system composed of multiple communicating components. SCFSM testing usually depends on finite state machine (FSM) testing as an SCFSM can be converted to an equivalent FSM. SCFSM testing, however, should consider the properties of SCFSMs which are different from those of component FSMs. This paper p...
متن کاملCombining Formal Refinement and Model Checking for Real-Time Systems Verification
We present a framework which combines model checking and theorem prover based refinement for the design of real-time systems focusing on the refinement step when annotating the state-oriented model with timing information. Our verification flow starts from a cycle-accurate finite state machine for the RAVEN model checker and present a translation which efficiently transforms the model to the B ...
متن کاملFormal mutation testing for Circus
Context: The demand from industry for more dependable and scalable test-development mechanisms has fostered the use of formal models to guide the generation of tests. Despite many advancements having been obtained with state-based models, such as Finite State Machines (FSMs) and Input/Output Transition Systems (IOTSs), more advanced formalisms are required to specify large, state-rich, concurre...
متن کامل